Cache-Oblivious Red-Blue Line Segment Intersection
نویسندگان
چکیده
We present an optimal cache-oblivious algorithm for finding all intersections between a set of non-intersecting red segments and a set of non-intersecting blue segments in the plane. Our algorithm uses O( B logM/B N B + T/B) memory transfers, where N is the total number of segments, M and B are the memory and block transfer sizes of any two consecutive levels of any multilevel memory hierarchy, and T is the number of intersections.
منابع مشابه
Cache Oblivious Distribution Sweeping
We adapt the distribution sweeping method to the cache oblivious model. Distribution sweeping is the name used for a general approach for divide-and-conquer algorithms where the combination of solved subproblems can be viewed as a merging process of streams. We demonstrate by a series of algorithms for specific problems the feasibility of the method in a cache oblivious setting. The problems al...
متن کاملFinding Intersections of Bichromatic Segments Defined by Points
Consider a set of n points in <, each colored either red or blue. A line segment defined by two red points is a red segment, and that defined by two blue points is a blue segment. A bichromatic intersection is an intersection between a red segment and a blue segment. We give an O(n + k) algorithm that reports k bichromatic intersections defined by the n points. Extending our algorithm to points...
متن کاملCounting and Reporting Red/Blue Segment Intersections
We simplify the red/blue segment intersection algorithm of Chazelle et al: Given sets of n disjoint red and n disjoint blue segments, we count red/blue intersections in O(n log n) time using O(n) space or report them in additional time proportional to their number. Our algorithm uses a plane sweep to presort the segments; then it operates on a list of slabs that eeciently stores a single level ...
متن کاملComputation of the Hausdorff distance between sets of line segments in parallel
We show that the Hausdorff distance for two sets of non-intersecting line segments can be computed in parallel in O(log n) time using O(n) processors in a CREW-PRAM computation model. We discuss how some parts of the sequential algorithm can be performed in parallel using previously known parallel algorithms; and identify the so-far unsolved part of the problem for the parallel computation, whi...
متن کاملAn Efficient Algorithm for the 1D Total Visibility-Index Problem
Let T be a terrain, and let P be a set of points (locations) on its surface. An important problem in Geographic Information Science (GIS) is computing the visibility index of a point p on P , that is, the number of points in P that are visible from p. The total visibility-index problem asks for computing the visibility index of every point in P . Most applications of this problem involve 2-dime...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008